Interval tree - PDFSEARCH.IO - Document Search Engine

Interval tree
Results: 64

#	Item
11	CCCG 2011, Toronto ON, August 10–12, 2011 Finding The Maximum Density Axes Parallel Regions for Weighted Point Sets Ananda Swarup Das Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Fractional cascading Computer programming Logarithm K-d tree Interval tree Mathematics Binary trees Computing
12	Box-Trees and R-trees with Near-Optimal Query Time P. K. Agarwaly , M. de Bergz , J. Gudmundssonz, M. Hammarx , H. J. Haverkortz y Dept. of Computer Science, Box 90129, Duke University, Durham, NC, USA, panka Add to Reading List Source URL: webdoc.sub.gwdg.de Language: English - Date: 2006-04-25 01:39:06 Computer programming 3D computer graphics Bin K-d tree Bounding volume hierarchy Bounding volume Interval tree Decision tree model Spatial database R-tree Computing Data management
13	DasNic_trs_printed_v4.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Database theory Range searching Computational geometry Logarithm Triangle Interval tree K-d tree Geometry Mathematics Elementary mathematics
14	Integrating the Relational Interval Tree into IBM’s DB2 Universal Database Server Christoph Brochhaus1, Jost Enderle1, Achim Schlosser1, Thomas Seidl1 and Knut Stolze2 1 RWTH Aachen University, Data Management and Exp Add to Reading List Source URL: subs.emis.de Language: English - Date: 2013-10-04 10:29:44 Data Relational database management systems Database theory Cross-platform software B-tree IBM DB2 Database index SQL Relational database Data management Computing Database management systems
15	CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Computing R-tree Segment tree K-d tree Measure B-tree Interval tree Fractional cascading Graph theory Binary trees Data management
16	Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Add to Reading List Source URL: jair.org Language: English - Date: 2012-03-19 16:09:33 Tree decomposition Interval graph Floyd–Warshall algorithm Neighbourhood Clique Split graph Shortest path problem Path decomposition Degeneracy Graph theory Graph operations Chordal graph
17	CCCG 2010, Winnipeg MB, August 9–11, 2010 Range Aggregate Structures for Colored Geometric Objects. Saladi Rahul∗ Haritha Bellam† Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Segment tree Computing Range searching Bin FO Lie groups Data management Mathematics Interval tree
18	CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Computing R-tree Segment tree K-d tree Measure B-tree Interval tree Fractional cascading Graph theory Binary trees Data management
19	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models Binay K. Bhattacharya∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-24 09:52:12 Binary trees Analysis of algorithms Computational complexity theory Time complexity Dynamic programming Interval graph Tree decomposition Rope Interval tree Graph theory Theoretical computer science Mathematics
20	Maximum Independent Set for Intervals by Divide-Prune-and-Conquer Jack Snoeyink∗ Dept. of Computer Science UNC Chapel Hill Lemma 1 Let T be a recursion tree with k leaves and Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:55 Order theory Topology Divide and conquer algorithm Independent set Algorithm Logarithm Interval tree Graph theory Mathematics Interval

UPDATE